Non-separating induced cycles in graphs
نویسندگان
چکیده
منابع مشابه
Non-separating Induced Cycles in Graphs
In this paper we consider non-separating induced cycles in graphs. A basic result is that any 2-connected graph with at least six vertices and without such a cycle has at least four vertices of degree 2, and this is best possible. For any 3-connected graph G we prove that there exists a non-separating induced cycle C, such that all cycles in G V(C) are contained in the same block of G V(C). We ...
متن کاملFinding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(gV 3/2 log V + gV ) time, where V is the number of vertices in the graph and g is the genus of the surface. If g = o(V ), this represents a considerable improvement over previous results by Thomassen, and Erickson and HarPeled. We also give algorithms to find a shortest non-contractibl...
متن کاملNon-separating trees in connected graphs
Let T be any tree of order d ≥ 1. We prove that every connected graph G with minimum degree d contains a subtree T ′ isomorphic to T such that G − V (T ) is connected.
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1981
ISSN: 0095-8956
DOI: 10.1016/s0095-8956(81)80025-1